Equidistribution of Matrix-Power Residues Modulo One
نویسندگان
چکیده
منابع مشابه
Equidistribution of Matrix-Power Residues
Here {y\ = y — [y] = the fractional part of y. The number N is an integer >1. The number x0 is a given initial value such that 0 ^ Xo < 1. The number 0 is fixed. Some early references to numerical work with sequences of the type (1) are given by 0. Taussky and J. Todd in [1]. Regarding the sequence x„ as a function of Xo, I proved in [2] that for almost all x0 the sequence x„ is equidistributed...
متن کاملDistribution of Residues Modulo p
The distribution of quadratic residues and non-residues modulo p has been of intrigue to the number theorists of the last several decades. Although Gauss’ celebrated Quadratic Reciprocity Law gives a beautiful criterion to decide whether a given number is a quadratic residue modulo p or not, it is still an open problem to find a small upper bound on the least quadratic non-residue mod p as a fu...
متن کامل/i POWER RESIDUES CONGRUENT TO ONE
In Theorem 2, we shall show that the only integers having property P(n), where n is an odd positive integer, are -2, -1, 1, and 2. In Theorem 3, we shall determine the integers which have property P(n) , where n is an even positive integer. In particular, we shall show that: m has property P(4) iff m divides 240 = 2̂ 3 -5 m has property P(6) iff m divides 504 = 23 * 7 m has property P(8) iff m d...
متن کاملTHE RESIDUES OF n* MODULO p
5. Uk = rUk_1 + sUk„2\ U0; U-L arbitrary (J/jff + £/0s#)(l ra s^)" = £7-̂ + (^ + sUQ)x + ••• or (£/0 + (U1 i/0)̂ )(l 2W sx)' = [/0 + U±x + (rU1 + s£/Q)x + ••• 6. Tn = p^.3. + sTn_2 rsTn_3; TQ9 T±s T2 arbitrary (T2x + (sT1 rsTQ)x rsT^) (1 rx s# + rsx)' = T2x + (vT2 + s ^ PS^Q)^ + ••• or (T0 + (Si -rT0)x + (T2 r ^ sT0)x)(l rx sx + P 2 X 3 ) 1 = T0 + T±x + T2x + (rT2 + sTx r TQ)x + •••• From the sol...
متن کاملA One-Step Modulo 2+1 Adder Based on Double-lsb Representation of Residues
Efficient modulo 2±1 adders are desirable for computer arithmetic units based on residue number systems (RNS) with the popular moduli set {2–1, 2, 2+1}. Regular n-bit ripple-carry adders or their fast equivalents are suitable for modulo 2 addition. But for the other two moduli a correcting increment/decrement step besides the primary n-bit addition is normally required. Several design efforts h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1964
ISSN: 0025-5718
DOI: 10.2307/2002942